Issues in a calculus of multiary sequent terms

نویسندگان

  • J. Esṕırito Santo
  • M. J. Frade
  • L. Pinto
  • Stefano Berardi
  • Mario Coppo
  • Ferruccio Damiani
چکیده

In this talk we overview our study on an extension of the λ-calculus introduced in [1], exhibiting the features of multiarity and generality. The former feature is the ability of applying a term to a list of arguments. The latter is the ability of specifying a future use, or “continuation”, for a (possibly multiary) application. The calculus was named the generalised multiary λ-calculus, or the λJm-calculus for short. In its simply typed version, the calculus corresponds to a sequent calculus, and the novelty of the mentioned features relates to the novelty of the left introduction rule relatively to a natural deduction format. The calculus was introduced in [1] as a calculus of multiary sequent terms (in the sense of [4]) for a study of permutative conversions in sequent calculus. The main lesson of this study is the existence of a relationship between permutative conversions, subsystems of λJm and the features of generality and multiarity. Moreover, some subsystems turn out to be isomorphic to fragments of natural deduction, taking natural deduction in the extended sense of von Plato [5]. Later work [2] observes an overlap between the features of generality and multiarity. In [2] the overlap is mainly used to transfer results about reduction from ΛJ to λJm, where ΛJ is the λ-calculus with generalised application introduced in [3]. In addition this overlap suggests a refinement of the original view of λJm as obtained from λ by modularly adding the two new features. This refinement is ongoing work. Another issue we are considering is that of obtaining a λ-term in βnormal form out of a λJm-term. This requires the combination of reduction and permutative conversion and, in particular, raises questions of termination. These questions relate to the problem of preservation of strong normalisation in calculi of explicit substitutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts

This work presents an extension with cuts of Schwichtenberg’s multiary sequent calculus. We identify a set of permutative conversions on it, prove their termination and confluence and establish the permutability theorem. We present our sequent calculus as the typing system of the generalised multiary λ-calculus λJ, a new calculus introduced in this work. λJ corresponds to an extension of λ-calc...

متن کامل

Refocusing Generalised Normalisation

When defined with general elimination/application rules, natural deduction and λ-calculus become closer to sequent calculus. In order to get real isomorphism, normalisation has to be defined in a “multiary” variant, in which reduction rules are necessarily non-local (reason: nomalisation, like cut-elimination, acts at the head of applicative terms, but natural deduction focuses at the tail of s...

متن کامل

Structural Proof Theory as Rewriting

The multiary version of the λ-calculus with generalized applications integrates smoothly both a fragment of sequent calculus and the system of natural deduction of von Plato. It is equipped with reduction rules (corresponding to cut-elimination/normalisation rules) and permutation rules, typical of sequent calculus and of natural deduction with generalised elimination rules. We argue that this ...

متن کامل

Completing Herbelin's Programme

In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the λ-calculus, specifically a variant which manipulates formally “applicative contexts” and inverts the associativity of “applicative terms”. Herbelin worked with a fragment of sequent calculus with c...

متن کامل

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Basic proof search tactics in logic and type theory can be seen as the rootrst applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of de ning such sequent calculi for Pure Type Systems (PTS, which are based on natural deduction) and then organizing their rules for effective proof search....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005